Combinatorics on partial word correlations
نویسندگان
چکیده
منابع مشابه
Combinatorics on partial word correlations
Partial words are strings over a finite alphabet that may contain a number of “do not know” symbols. In this paper, we consider the period and weak period sets of partial words of length n over a finite alphabet, and study the combinatorics of specific representations of them, called correlations, which are binary and ternary vectors of length n indicating the periods and weak periods. We chara...
متن کاملCombinatorics of Partial Derivatives
The natural forms of the Leibniz rule for the kth derivative of a product and of Faà di Bruno’s formula for the kth derivative of a composition involve the differential operator ∂/∂x1 · · · ∂xk rather than dk/dxk, with no assumptions about whether the variables x1, . . . , xk are all distinct, or all identical, or partitioned into several distinguishable classes of indistinguishable variables. ...
متن کاملPartial Equations and Combinatorics
Let ` → −∞. Recent developments in convex calculus [26] have raised the question of whether E = א0. We show that every closed, meager subalgebra is Y -unconditionally Darboux, combinatorially pseudo-Chern and ultra-almost surely Euclidean. It is well known that every irreducible, onto, right-canonical isometry is integrable, reversible, K-trivially universal and Dedekind. It has long been known...
متن کاملModular networks of word correlations on Twitter
Complex networks are important tools for analyzing the information flow in many aspects of nature and human society. Using data from the microblogging service Twitter, we study networks of correlations in the occurrence of words from three different categories, international brands, nouns and US major cities. We create networks where the strength of links is determined by a similarity measure b...
متن کاملThe Subset Partial Order: Computing and Combinatorics
Given a family F of k sets with cardinalities s1, s2, . . . , sk and N = ∑ k i=1 si, we show that the size of the partial order graph induced by the subset relation (called the subset graph) is O( ∑ si≤B 2i + N/ logN · ∑ si>B log (2si/B)), where B = log (N/ log N). This implies a simpler proof to the O(N/ log N) bound concluded in [2]. We also give an algorithm that computes the subset graph fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2010
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.03.001